Enabling parallel computing in crash

Enabling Chaotic Ubiquitous Computing

Today, ubiquitous computing is possible only in handcrafted environments, and not across administrative and technological domains. For this to happen, a middleware “ecology” will need to emerge, so that users can exploit a chaotic environment of competing communication and service providers, and overlapping administrative authorities. Although key elements of the ecology exist today, simple exp...

Computing Game Values for Crash Games

We consider crash games which are a generalization of parity games in which the play value of a play is an integer, −∞ or ∞. In particular, the play value of a finite play is given as the sum of the payoffs of the moves of the play. Accordingly, one player aims at maximizing the play value whereas the other player aims at minimizing this value. We show that the game value of such a crash game a...

Crash Management for Distributed Parallel Systems

With the growing complexity of parallel architectures, the probability of system failures grows, too. One approach to cope with this problem is the self-healing, one of the organic computing’s self-x features. Self-healing in this context means that computer clusters should detect and handle failures automatically. This paper presents a self-healing mechanism based on checkpointing, so that a c...

Parallel Computing in Chemistry

This paper intends to discuss the role of parallel computing in computational chemistry. As the terminology implies computational chemistry is heavily dependent on the computational power available. Much of the field involved running programs and applications on single processor systems. Even though processor power has improved steadily (Moores Law [1]) over the years, the need for more CPU pow...

Computing eigenvalues in parallel